A Graph Rewriting Model of Concurrent Programs with Higher-Order Communication
نویسنده
چکیده
This paper presents congruence results of a behavioural equivalence on a graph rewriting model of concurrent pro cesses with higher-order communication. A bipartite di rected acyclic graph represents a concurrent system that consists of a number of processes and messages in our model. The model presented here makes it possible to repre sent local names that their scopes are not nested. We show that strong bisimulation equivalence relation is a congru ence relation w.r.t. operations that correspond to Ü-prefix, input prefix, new-name, replication, composition and appli cation respectively.
منابع مشابه
On Compilation of Higher-Order Concurrent Programs into First Order Programs Preserving Scope Equivalence
This paper discusses the expressive power of a graph rewriting model of concurrent processes with higherorder communication. As we reported before, it is difficult to represent the scopes of names using models based on process algebra. Then we presented a model of concurrent systems based on graph rewriting. The model makes it possible to represent the scopes of names precisely. We defined an e...
متن کاملConcurrent Clean
Concurrent Clean is an experimental, lazy, higher-order parallel functional programming language based on term graph rewriting. An important diierence with other languages is that in Clean graphs are manipulated and not terms. This can be used by the programmer to control communication and sharing of computation. Cyclic structures can be deened. Concurrent Clean furthermore allows to control th...
متن کاملImplementing concurrent logic and functional languages in Dactl
A methodology is developed for mapping a wide class of concurrent logic languages (CLLs) onto Dactl, a compiler target language based on generalised graph rewriting. We show how features particular to the generalised graph rewriting model (such as non root overwrites and sharing) can be used to implement CLLs. We identify problems in the mapping of a concurrent logic program to an equivalent se...
متن کاملMulti-Paradigm Programming through Graph Rewriting: Case for Support
The project aims to demonstrate that extended notions of graph rewriting can act as the basis for practical implementations of multi-paradigm languages, based on largely declarative principles. The languages chosen will combine process and functional programming on the one hand and functional and concurrent logic programming on the other. The objective is to support implementations on both sequ...
متن کاملA Highly Parallel Model for Object-Oriented Concurrent Constraint Programming
Two of the currently most promising programming paradigms, namely Object-Oriented Programming and Concurrent Constraint Programming are combined into a single, highly parallel computational model based on Term Graph Rewriting Systems. In particular, we show how multi-headed Term Graph rewrite rules provide a powerful tool able to manipulate Term Graphs which themselves represent in a homogeneou...
متن کامل